翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

test functions for optimization : ウィキペディア英語版
test functions for optimization
In applied mathematics, test functions, known as artificial landscapes, are useful to evaluate characteristics of optimization algorithms, such as:
* Velocity of convergence.
* Precision.
* Robustness.
* General performance.
Here some test functions are presented with the aim of giving an idea about the different situations that optimization algorithms have to face when coping with these kinds of problems. In the first part, some objective functions for single-objective optimization cases are presented. In the second part, test functions with their respective Pareto fronts for multi-objective optimization problems (MOP) are given.
The artificial landscapes presented herein for single-objective optimization problems are taken from Bäck, Haupt et. al. and from Rody Oldenhuis software. Given the amount of problems (55 in total), just a few are presented here. The complete list of test functions is found on the Mathworks website.
The test functions used to evaluate the algorithms for MOP were taken from Deb,〔Deb, Kalyanmoy (2002) Multiobjective optimization using evolutionary algorithms (Repr. ed.). Chichester (): Wiley. ISBN 0-471-87339-X.〕 Binh et. al.〔Binh T. and Korn U. (1997) MOBES: A Multiobjective Evolution Strategy for Constrained Optimization Problems. In: Proceedings of the Third International Conference on Genetic Algorithms. Czech Republic. pp. 176-182〕 and Binh.〔Binh T. (1999) A multiobjective evolutionary algorithm. The study cases. Technical report. Institute for Automation and Communication. Barleben, Germany〕 You can download the software developed by Deb,〔Deb K. (2011) Software for multi-objective NSGA-II code in C. Available at URL:http://www.iitk.ac.in/kangal/codes.shtml. Revision 1.1.6〕 which implements the NSGA-II procedure with GAs, or the program posted on Internet, which implements the NSGA-II procedure with ES.
Just a general form of the equation, a plot of the objective function, boundaries of the object variables and the coordinates of global minima are given herein.
==Test functions for single-objective optimization problems==

\right)}\right)
-\exp\left(0.5\left(\cos\left(2\pi x\right)+\cos\left(2\pi y\right)\right)\right) + e + 20
||f(0,0) = 0
||-5\le x,y \le 5
|-
| Sphere function
||
|| f(\boldsymbol) = \sum_^ x_^
|| f(x_, \dots, x_) = f(0, \dots, 0) = 0
|| -\infty \le x_ \le \infty, 1 \le i \le n
|-
| Rosenbrock function
||
|| f(\boldsymbol) = \sum_^ \left(100 \left(x_ - x_^\right)^ + \left(x_ - 1\right)^\right )
|| \text =
\begin
n=2 & \rightarrow \quad f(1,1) = 0, \\
n=3 & \rightarrow \quad f(1,1,1) = 0, \\
n>3 & \rightarrow \quad f\left(\underbrace_

|| -\infty \le x_ \le \infty, 1 \le i \le n
|-
| Beale's function
||
|| f(x,y) = \left( 1.5 - x + xy \right)^ + \left( 2.25 - x + xy^\right)^
+ \left(2.625 - x+ xy^\right)^
|| f(3, 0.5) = 0
|| -4.5 \le x,y \le 4.5
|-
| Goldstein–Price function:
||
|| f(x,y) = \left(1+\left(x+y+1\right)^\left(19-14x+3x^-14y+6xy+3y^\right)\right)
\left(30+\left(2x-3y\right)^\left(18-32x+12x^+48y-36xy+27y^\right)\right)
|| f(0, -1) = 3
|| -2 \le x,y \le 2
|-
| Booth's function:
||
||f(x,y) = \left( x + 2y -7\right)^ + \left(2x +y - 5\right)^
||f(1,3) = 0
||-10 \le x,y \le 10
|-
| Bukin function N.6:
||
|| f(x,y) = 100\sqrt + 0.01 \left|x+10 \right|.\quad
|| f(-10,1) = 0
|| -15\le x \le -5, -3\le y \le 3
|-
| Matyas function:
||
|| f(x,y) = 0.26 \left( x^ + y^\right) - 0.48 xy
|| f(0,0) = 0
|| -10\le x,y \le 10
|-
| Lévi function N.13:
||
|| f(x,y) = \sin^\left(3\pi x\right)+\left(x-1\right)^\left(1+\sin^\left(3\pi y\right)\right)
+\left(y-1\right)^\left(1+\sin^\left(2\pi y\right)\right)
|| f(1,1) = 0
|| -10\le x,y \le 10
|-
| Three-hump camel function:
||
|| f(x,y) = 2x^ - 1.05x^ + \frac + xy + y^
|| f(0,0) = 0
|| -5\le x,y \le 5
|-
| Easom function:
||
|| f(x,y) = -\cos \left(x\right)\cos \left(y\right) \exp\left(-\left(\left(x-\pi\right)^ + \left(y-\pi\right)^\right)\right)
|| f(\pi , \pi) = -1
|| -100\le x,y \le 100
|-
| Cross-in-tray function:
||
|| f(x,y) = -0.0001 \left( \left| \sin \left(x\right) \sin \left(y\right) \exp \left( \left|100 - \frac}} \right|\right)\right| + 1 \right)^
|| \text =
\begin
f\left(1.34941, -1.34941\right) & = -2.06261 \\
f\left(1.34941, 1.34941\right) & = -2.06261 \\
f\left(-1.34941, 1.34941\right) & = -2.06261 \\
f\left(-1.34941,-1.34941\right) & = -2.06261 \\
\end

|| -10\le x,y \le 10
|-
| Eggholder function:
||
|| f(x,y) = - \left(y+47\right) \sin \left(\sqrt+47\right|}\right) - x \sin \left(\sqrt\right)
|| f(512, 404.2319) = -959.6407
|| -512\le x,y \le 512
|-
| Hölder table function:
||
|| f(x,y) = - \left|\sin \left(x\right) \cos \left(y\right) \exp \left(\left|1 - \frac}} \right|\right)\right|
|| \text =
\begin
f\left(8.05502, 9.66459\right) & = -19.2085 \\
f\left(-8.05502, 9.66459\right) & = -19.2085 \\
f\left(8.05502,-9.66459\right) & = -19.2085 \\
f\left(-8.05502,-9.66459\right) & = -19.2085
\end

|| -10\le x,y \le 10
|-
| McCormick function:
||
|| f(x,y) = \sin \left(x+y\right) + \left(x-y\right)^ - 1.5x + 2.5y + 1
|| f(-0.54719,-1.54719) = -1.9133
|| -1.5\le x \le 4, -3\le y \le 4
|-
| Schaffer function N. 2:
||
|| f(x,y) = 0.5 + \frac - y^\right) - 0.5}\right) \right)^}
|| f(0, 0) = 0
|| -100\le x,y \le 100
|-
| Schaffer function N. 4:
||
|| f(x,y) = 0.5 + \frac - y^\right|\right)\right) - 0.5}\right) \right)^}
|| f(0,1.25313) = 0.292579
|| -100\le x,y \le 100
|-
| Styblinski–Tang function:
||
|| f(\boldsymbol) = \frac x_^ - 16x_^ + 5x_}
|| -39.16617n < f\left(\underbrace_ \le 5, 1\le i \le n.
|-
| Simionescu function:
||
|| f(x,y) = 0.1xy,
\text x^2+y^2\le\left(r_+r_\cos\left(n \arctan \frac \right)\right)^2
\text r_=1, r_=0.2 \text n = 8
|| f(\pm 0.85586214,\mp 0.85586214) = -0.072625
|| -1.25\le x,y \le 1.25
|}

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「test functions for optimization」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.